Computing Equilibria of N-Person Games

Computing Equilibria for Two-person Games

Computing Equilibria for Two-Person Games

This paper is a self-contained survey of algorithms for computing Nash equilibria of two-person games given in normal form or extensive form. The classical Lemke{Howson algorithm for nding one equilibrium of a bimatrix game is presented graph-theoretically as well as algebraically in terms of complementary pivoting. Common deenitions of degenerate games are shown as equivalent. Enumeration of a...

Computing Normal Form Perfect Equilibria for Extensive Two-person Games

This paper presents an algorithm for computing an equilibrium of an extensive two-person game with perfect recall. The method is computationally efficient by virtue of using the sequence form, whose size is proportional to the size of the game tree. The equilibrium is traced on a piecewise linear path in the sequence form strategy space from an arbitrary starting vector. If the starting vector ...

Stochastically stable equilibria in n-person binary coordination games

Best response structure of n-person binary coordination games suggests that equilibrium selection outcome is determined by the balance of the ordinal aspects and the cardinal aspects of the game. This intuition inspires new equilibrium selection results for that class of games under the adaptive play with mistakes. Detailed comparison of the adaptive play and the single population random matchi...

Computing Equilibria of N-Player Games with Arbitrary Accuracy

From a variant of Kuhn’s triangulation we derive a discrete version of the Global Newton Method that yields an epsilon-equilibrium of an N-player game and then sequentially reduces epsilon toward zero to obtain any desired precision or the best precision for any number of iterations. COMPUTING EQUILIBRIA OF N-PLAYER GAMES WITH ARBITRARY ACCURACY SRIHARI GOVINDAN AND ROBERT WILSON Abstract. From...